Optimization Flow Control , I : Basic Algorithm andConvergenceSteven
نویسندگان
چکیده
| We propose an optimization approach to ow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In this system sources select transmission rates that maximize their own beneets, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be diierent, substantial and time{varying, and links and sources to update at diierent times and with diier-ent frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time{varying environment.
منابع مشابه
Optimization of continual production of CNTs by CVD method using Radial Basic Function (RBF) neural network and the Bees Algorithm
Optimization of continuous synthesis of high purity carbon nanotubes (CNTs) using chemical vapour deposition (CVD) method was studied experimentally and theoretically. Iron pentacarbonyl (Fe(CO)5), acetylene (C2H2) and Ar were used as the catalyst source, carbon source and carrier gas respectively. The synthesis temperature and flow rates of Ar and acetylene were optimized to produce CNTs at a ...
متن کاملCorrection to Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"
In the note an error in Low and Lapsley’s article [1] is pointed out. Because of this error the proof of the Theorem 2 presented in the article is incomplete and
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملA New Algorithm for Load Flow Analysis in Autonomous Networks
In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...
متن کامل